On 3-D Point Set Matching With MAE and SAE Cost Criteria
نویسندگان
چکیده
منابع مشابه
On the Curve/Point Set Matching Problem
Let P be a polygonal curve in R of length n, and S be a point set of size k. We consider the problem of finding a polygonal curve Q on S such that all points in S are visited and the Fréchet distance between Q and P is at most a given ε. We show that this problem is NP-complete, regardless of whether or not the points of S are allowed to be visited more than once.
متن کاملHardness Results on Curve/Point Set Matching with Fréchet Distance
Let P be a polygonal curve in R of length n, and S be a point-set of size k. We consider the problem of finding a polygonal curve Q on S such that all points in S are visited and the Fréchet distance from P is less than a given ε. We show that this problem is NP-complete, regardless of whether or not points from S are allowed be visited more than once. However, we also show that if the problem ...
متن کاملCombinatorial Boundary Tracking of a 3 D Lattice Point Set
Boundary tracking and surface generation are ones of main topological topics for threedimensional digital image analysis. However, there is no adequate theory to make relations between these different topological properties in a completely discrete way, In this paper, we present a new boundary tracking algorithm which gives not only a set of border points but also the surface structures by usin...
متن کاملA Partial Matching Framework Based on Set Exclusion Criteria
This article introduces a partial matching framework, based on set theory criteria, for the measurement of shape similarity. The matching framework is described in an abstract way because the proposed scheme is independent of the selection of a segmentation method and feature space. This paradigm ensures the high adaptability of the algorithm and brings the implementer a wide control over the r...
متن کاملOn the Parameterized Complexity of d-Dimensional Point Set Pattern Matching
Deciding whether two n-point sets A,B ∈ R are congruent is a fundamental problem in geometric pattern matching. When the dimension d is unbounded, the problem is equivalent to graph isomorphism and is conjectured to be in FPT. When |A| = m < |B| = n, the problem becomes that of deciding whether A is congruent to a subset of B and is known to be NP-complete. We show that point subset congruence,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans
سال: 2008
ISSN: 1083-4427,1558-2426
DOI: 10.1109/tsmca.2007.914774